MOV instruction copies the data from one location to other
MVI B, 82H / Copy value 82H to register B
MOV A, B / Copy value of B (82H) to accumulator A
MOV C, A / Copy value of accumulator A (82H) to register C
MVI D, 37H / Copy value 37H to register D
OUT PORT1 /Copy value of accumulator A (82H) to PORT 1 (because still accumulator A is having 82H)

DI(Disable Interrupt): DI allows the microprocessor to reject the interrupt. In DI the interrupts are disabled immediately and no flags are affected.
SIM(Set Instruction Mask): It uses flags to disable the interrupts. Here “1” indicated that the interrupt is masked and “0” indicates the the instruction is not masked.

→ In one second, device is sending - 4800 characters to DMA
→ 1 character = 8 bits
→ So in one second, device is sending - (4800⨯8) bits to DMA
→ In one cycle, DMA sends - 32 bits.
→ To send (4800 ⨯ 8) bits DMA needs = (4800⨯8)/30 cycles = 1200 cycles
→ Now in one second CPU executes 10⁶ instructions.
→ But because of cycle stealing, CPU has slow down and the % by which CPU gets slow down can be calculated as
= 1200/10⁶ * 100
= 12/10000 * 100
=0.12%

CPU after completing the execution of a instruction checks the status of interrupt if there is a interrupt then CPU executes the interrupt service routine to service it else CPU stats executing next instruction.

Excluded for evaluation

Forward Chaining: Forward chaining starts with the available data and uses inference rules to extract more data until a conclusion is reached.
It is also known as data driven inference technique.
It is bottom up reasoning.
It is a breadth first search.
For Example: “If it is raining then i will bring the umbrella”. Here “it is raining” is a available data from which more data is extracted and a conclusion “i will bring the umbrella” is drived.
Backward Chaining: Backward chaining is an inference method described colloquially as working backward from the goal.
It is also known as goal driven inference technique.
Here we starts from a goal and apply inference rules to get some data.
It is top down reasoning.
It is a depth first search.
For Example: “If it is raining then i will bring the umbrella”. Here our conclusion is “i will bring the umbrella”. Now If I am bringing an umbrella then it can be stated that it is raining that is why I am bringing the umbrella. So here “ It is raining” is the data obtained from goal . Hence it was derived in a backward direction so it is the process of backward chaining.

→ Dynamic programming language is a class of high-level programming languages which, at runtime, execute many common programming behaviors that static programming languages perform during compilation. These behaviors could include extension of the program, by adding new code, by extending objects and definitions, or by modifying the type system.
→ Ada is a structured, statically typed, imperative, and object-oriented high-level computer programming language, extended from Pascal and other languages.
→ Prolog is a logic programming language associated with artificial intelligence and computational linguistics. Prolog is intended primarily as a declarative programming language: the program logic is expressed in terms of relations, represented as facts and rules.
→ Python is dynamically typed and garbage-collected. It supports multiple programming paradigms, including procedural, object-oriented, and functional programming

Socket address: A socket address is used to uniquely identify a process on a host.
Example: There can be multiple hosts that are communicating to a server. So to identify each host uniquely IP address is required. Now there could be multiple processes executing on a host machine So to identify each process uniquely on a host Port number is used.
So to identify a process on a host combination of an IP address and a port number is used and this combination is termed as Socket Address.
Socket Address is a 48-bit address which includes 32 -bit IP address and 16-bit Port address.

1 minute - 1500 frames
60 seconds - 1500 frames
1 second - 1500/60 frames
1 second = 25 frames
Now each frame is of 8,000 bits.
So total bits in 1 second = 25 × 80 bits
= 25×8000/1000000 Mbps
= 200/100 Mbps
= 2 Mbps

For example, consider a subnet with 720 routers. If there is no hierarchy, each router needs 720 routing table entries.
If the subnet is partitioned into 24 regions of 30 routers each, each router needs 30 local entries plus 23 remote entries for a total of 53 entries.
If a three-level hierarchy is chosen, with eight clusters, each containing 9 regions of 10 routers, each router needs 10 entries for local routers, 8 entries for routing to other regions within its own cluster, and 7 entries for distant clusters, for a total of 25 entries.

In a classful addressing, the IP addresses with 0 (zero) as network number refers to the default IP of a host when it has no IP. When a host don’t have any IP then it sends a RARP request by having 0.0.0.0 as source IP.
NOTE: So none of the options is correct but according to UGC official answer keys the correct answer is given as option(A)

SMTP(Simple Mail Transfer Protocol) is used to send mail containing text, voice, video, to MTA of destination.
MIME(Multimedia Internet Mail Extension) is not a mail protocol. It is used to send mails containing ASCII and Non-ASCII files.
It is an extension of SMTP but not a mail protocol.
POP3(Post Office Protocol) is a client server architecture used to download message from MTA to workstation for offline use.
IMAP(Internet Message Access Protocol) is a client server architecture used to check messages without downloading from MTA.

Explanation: 1 character ------- 8-bits
1,00,000 character ---------- 8,00,000 bits
2000 bits--------- 1 second
1 bit ---------- 1/2000 seconds
8,00,000 bits ---------(1/2000)* 8,00,000
= 400 seconds

Each activity a_i has a start time s_i and a finish time f_i where 0 ≤ s_i < f_i < ∞. If selected, activity a_i takes place during the half-open time interval [ s_i , f_i ]. Activities a_i and a_j are compatible if the intervals [ s_i , f_i ] and [ s_j , f_j ] do not overlap. That is, a_i and a_j are compatible if s_i ≥ f_j or s_j ≥ f_i. In the activity-selection problem, we wish to select a maximum-size subset of mutually compatible activities.

The radix sort running time depends on the stable sort used as the intermediate sorting algorithm. When each digit is in the range 0 to k-1(It takes k possible values), and ‘k’ is not too large, counting sort is the obvious choice. Each pass over n d-digits numbers then takes time O(n+k). There are ‘d’ passes, and so total time for radix sort is O(d (n + k))